Interrupted creep behaviour of Mg alloys developed for powertrain applications

A conventional magnesium alloy, AZ91D, and two creep resistant magnesium alloys, developed for powertrain applications, MRI 153M and MRI 230D, are prepared by high pressure die casting. These alloys are tested for their creep behaviour in the continuous manner, as is the Current practice, and in the interrupted manner, which represents the real life Situation more closely. It is observed that the interrupted creep tests give rise to a primary creep appearing at the beginning of each cycle resulting in a higher average strain rate than that encountered in the continuous creep tests. Further, the shorter the cycle time, higher is the average strain rate in the interrupted creep tests. A higher average strain rate will give rise to a higher strain over the same period. This is attributed to the recovery taking place during the cooling and heating between two cycles. The effect of additional precipitation during interrupted creep tests depends on the nature of the precipitates. The additional precipitation of beta phase during the cooling and heating between two cycles increases the steady state strain rate in the AZ91D and MRI 153M alloys. whereas the additional precipitation of C36 phase during the cooling and heating between two cycles decreases the steady state strain rate in the MRI 230D alloy. (C) 2009 Elsevier B.V. All rights reserved.

Memory Architecture Exploration Framework for Cache Based Embedded SoC

Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and lower energy consumption. The memory architecture of the embedded system strongly influences critical system design objectives like area, power and performance. Hence the embedded system designer performs a complete memory architecture exploration to custom design a memory architecture for a given set of applications. Further, the designer would be interested in multiple optimal design points to address various market segments. However, tight time-to-market constraints enforces short design cycle time. In this paper we address the multi-level multi-objective memory architecture exploration problem through a combination of exhaustive-search based memory exploration at the outer level and a two step based integrated data layout for SPRAM-Cache based architectures at the inner level. We present a two step integrated approach for data layout for SPRAM-Cache based hybrid architectures with the first step as data-partitioning that partitions data between SPRAM and Cache, and the second step is the cache conscious data layout. We formulate the cache-conscious data layout as a graph partitioning problem and show that our approach gives up to 34% improvement over an existing approach and also optimizes the off-chip memory address space. We experimented our approach with 3 embedded multimedia applications and our approach explores several hundred memory configurations for each application, yielding several optimal design points in a few hours of computation on a standard desktop.

MAX: A Multi Objective Memory Architecture eXploration Framework for Embedded Systems-on-Chip

Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and lower energy consumption. The memory architecture of the embedded system strongly influences these parameters. Hence the embedded system designer performs a complete memory architecture exploration. This problem is a multi-objective optimization problem and can be tackled as a two-level optimization problem. The outer level explores various memory architecture while the inner level explores placement of data sections (data layout problem) to minimize memory stalls. Further, the designer would be interested in multiple optimal design points to address various market segments. However, tight time-to-market constraints enforces short design cycle time. In this paper we address the multi-level multi-objective memory architecture exploration problem through a combination of Multi-objective Genetic Algorithm (Memory Architecture exploration) and an efficient heuristic data placement algorithm. At the outer level the memory architecture exploration is done by picking memory modules directly from a ASIC memory Library. This helps in performing the memory architecture exploration in a integrated framework, where the memory allocation, memory exploration and data layout works in a tightly coupled way to yield optimal design points with respect to area, power and performance. We experimented our approach for 3 embedded applications and our approach explores several thousand memory architecture for each application, yielding a few hundred optimal design points in a few hours of computation time on a standard desktop.

A Scalable Low Power Issue Queue for Large Instruction Window Processors

Large instruction windows and issue queues are key to exploiting greater instruction level parallelism in out-of-order superscalar processors. However, the cycle time and energy consumption of conventional large monolithic issue queues are high. Previous efforts to reduce cycle time segment the issue queue and pipeline wakeup. Unfortunately, this results in significant IPC loss. Other proposals which address energy efficiency issues by avoiding only the unnecessary tag-comparisons do not reduce broadcasts. These schemes also increase the issue latency.To address both these issues comprehensively, we propose the Scalable Lowpower Issue Queue (SLIQ). SLIQ augments a pipelined issue queue with direct indexing to mitigate the problem of delayed wakeups while reducing the cycle time. Also, the SLIQ design naturally leads to significant energy savings by reducing both the number of tag broadcasts and comparisons required.A 2 segment SLIQ incurs an average IPC loss of 0.2% over the entire SPEC CPU2000 suite, while achieving a 25.2% reduction in issue latency when compared to a monolithic 128-entry issue queue for an 8-wide superscalar processor. An 8 segment SLIQ improves scalability by reducing the issue latency by 38.3% while incurring an IPC loss of only 2.3%. Further, the 8 segment SLIQ significantly reduces the energy consumption and energy-delay product by 48.3% and 67.4% respectively on average.

High temperature time-dependent low cycle fatigue behaviour of a type 316L(N) stainless steel

Total strain controlled low cycle fatigue tests on 316L(N) stainless steel have been conducted in air at various strain rates in the temperature range of 773-873 K to identify the operative time-dependent mechanisms and to understand their influence on the cyclic deformation and fracture behaviour of the alloy. The cyclic stress response at all the testing conditions was marked by an initial hardening followed by stress saturation. A negative strain rate stress response is observed under specific testing conditions which is attributed to dynamic strain ageing (DSA). Transmission electron microscopy studies reveal that there is an increase in the dislocation density and enhanced slip planarity in the DSA regime. Fatigue life is found to decrease with a decrease in strain rate. The degradation in fatigue resistance is attributed to the detrimental effects associated with DSA and oxidation. Quantitative measurement of secondary cracks indicate that both transgranular and intergranular cracking are accelerated predominantly under conditions conducive to DSA.

Role of conformational dynamics in kinetics of an enzymatic cycle in a nonequilibrium steady state

Enzyme is a dynamic entity with diverse time scales, ranging from picoseconds to seconds or even longer. Here we develop a rate theory for enzyme catalysis that includes conformational dynamics as cycling on a two-dimensional (2D) reaction free energy surface involving an intrinsic reaction coordinate (X) and an enzyme conformational coordinate (Q). The validity of Michaelis-Menten (MM) equation, i.e., substrate concentration dependence of enzymatic velocity, is examined under a nonequilibrium steady state. Under certain conditions, the classic MM equation holds but with generalized microscopic interpretations of kinetic parameters. However, under other conditions, our rate theory predicts either positive (sigmoidal-like) or negative (biphasic-like) kinetic cooperativity due to the modified effective 2D reaction pathway on X-Q surface, which can explain non-MM dependence previously observed on many monomeric enzymes that involve slow or hysteretic conformational transitions. Furthermore, we find that a slow conformational relaxation during product release could retain the enzyme in a favorable configuration, such that enzymatic turnover is dynamically accelerated at high substrate concentrations. The effect of such conformation retainment in a nonequilibrium steady state is evaluated.

A novel DNA intercalator, butylamino-pyrimido[4',5':4,5]selenolo(2,3-b)quinoline, induces cell cycle arrest and apoptosis in leukemic cells

DNA intercalators are one of the most commonly used chemotherapeutic agents. Novel intercalating compounds of pyrimido[4',5':4,5]selenolo(2,3-b)quinoline series having a butylamino or piperazino group at fourth position (BPSQ and PPSQ, respectively) are studied. Our results showed that BPSQ induced cytotoxicity whereas PPSQ was cytostatic. The cytotoxicity induced by BPSQ was concentration- and time-dependent. Cell cycle analysis and tritiated thymidine assay revealed that BPSQ affects the cell cycle progression by arresting at S phase. The absence of p-histone H3 and reduction in the levels of PCNA in the cells treated with BPSQ further confirmed the cell cycle arrest. Further, annexin V staining, DNA fragmentation, nuclear condensation and changes in the expression levels of BCL2/BAD confirmed the activation of apoptosis. Activation of caspase 8 and lack of cleavage of caspase 9, caspase 3 and PARP suggest the possibility of BPSQ triggering extrinsic pathway for induction of apoptosis, which is discussed. Hence, we have identified a novel compound which would have clinical relevance in cancer chemotherapeutics.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Glioblastoma-Specific Protein Interaction Network Identifies PP1A and CSK21 as Connecting Molecules between Cell Cycle-Associated Genes

Glioblastoma (GBM; grade IV astrocytoma) is a very aggressive form of brain cancer with a poor survival and few qualified predictive markers. This study integrates experimentally validated genes that showed specific upregulation in GBM along with their protein-protein interaction information. A system level analysis was used to construct GBM-specific network. Computation of topological parameters of networks showed scale-free pattern and hierarchical organization. From the large network involving 1,447 proteins, we synthesized subnetworks and annotated them with highly enriched biological processes. A careful dissection of the functional modules, important nodes, and their connections identified two novel intermediary molecules CSK21 and protein phosphatase 1 alpha (PP1A) connecting the two subnetworks CDC2-PTEN-TOP2A-CAV1-P53 and CDC2-CAV1-RB-P53-PTEN, respectively. Real-time quantitative reverse transcription-PCR analysis revealed CSK21 to be moderately upregulated and PP1A to be overexpressed by 20-fold in GBM tumor samples. Immunohistochemical staining revealed nuclear expression of PP1A only in GBM samples. Thus, CSK21 and PP1A, whose functions are intimately associated with cell cycle regulation, might play key role in gliomagenesis. Cancer Res; 70(16); 6437-47. (C)2010 AACR.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Numerical Modelling of the Observed Diurnal Cycle of Indian Monsoon Rainfall

We have analysed the diurnal cycle of rainfall over the Indian region (10S-35N, 60E-100E) using both satellite and in-situ data, and found many interesting features associated with this fundamental, yet under-explored, mode of variability. Since there is a distinct and strong diurnal mode of variability associated with the Indian summer monsoon rainfall, we evaluate the ability of the Weather Research and Forecasting Model (WRF) to simulate the observed diurnal rainfall characteristics. The model (at 54km grid-spacing) is integrated for the month of July, 2006, since this period was particularly favourable for the study of diurnal cycle. We first evaluate the sensitivity of the model to the prescribed sea surface temperature (SST), by using two different SST datasets, namely, Final Analyses (FNL) and Real-time Global (RTG). It was found that with RTG SST the rainfall simulation over central India (CI) was significantly better than that with FNL. On the other hand, over the Bay of Bengal (BoB), rainfall simulated with FNL was marginally better than with RTG. However, the overall performance of RTG SST was found to be better than FNL, and hence it was used for further model simulations. Next, we investigated the role of the convective parameterization scheme on the simulation of diurnal cycle of rainfall. We found that the Kain-Fritsch (KF) scheme performs significantly better than Betts-Miller-Janjić (BMJ) and Grell-Devenyi schemes. We also studied the impact of other physical parameterizations, namely, microphysics, boundary layer, land surface, and the radiation parameterization, on the simulation of diurnal cycle of rainfall, and identified the “best” model configuration. We used this configuration of the “best” model to perform a sensitivity study on the role of various convective components used in the KF scheme. In particular, we studied the role of convective downdrafts, convective timescale, and feedback fraction, on the simulated diurnal cycle of rainfall. The “best” model simulations, in general, show a good agreement with observations. Specifically, (i) Over CI, the simulated diurnal rainfall peak is at 1430 IST, in comparison to the observed 1430-1730 IST peak; (ii) Over Western Ghats and Burmese mountains, the model simulates a diurnal rainfall peak at 1430 IST, as opposed to the observed peak of 1430-1730 IST; (iii) Over Sumatra, both model and observations show a diurnal peak at 1730 IST; (iv) The observed southward propagating diurnal rainfall bands over BoB are weakly simulated by WRF. Besides the diurnal cycle of rainfall, the mean spatial pattern of total rainfall and its partitioning between the convective and stratiform components, are also well simulated. The “best” model configuration was used to conduct two nested simulations with one-way, three-level nesting (54-18-6km) over CI and BoB. While, the 54km and 18km simulations were conducted for the whole of July, 2006, the 6km simulation was carried out for the period 18 - 24 July, 2006. The results of our coarse- and fine-scale numerical simulations of the diurnal cycle of monsoon rainfall will be discussed.

An (O)over-bar(m(2)n) randomized algorithm to compute a minimum cycle basis of a directed graph

We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {- 1, 0, 1} incidence vector is associated with each cycle and the vector space over Q generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in O(m(w+1)n) time (where w < 2.376 is the exponent of matrix multiplication). If one allows randomization, then an (O) over tilde (m(3)n) algorithm is known for this problem. In this paper we present a simple (O) over tilde (m(2)n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. In this problem a {0, 1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m(2)n + mn(2) logn) time and our randomized algorithm for directed graphs almost matches this running time.

IN-VITRO CYTOTOXICITY AND CELL CYCLE ANALYSIS OF TWO NOVEL BIS-1, 2, 4-TRIAZOLE DERIVATIVES: 1,4-BIS[5-(5-MERCAPTO-1,3,4-OXADIAZOL-2-yl-METHYL)-THIO-4-(p-TOLYL)-1, 2,4-TRIAZOL-3-yl]-BUTANE (MNP-14) AND 1,4-BIS[5-(CARBETHOXY-METHYL)-THIO-4-(p-ETHOXY PHENYL)-1,2,4-TRIAZOL-3-yl]-BUTANE (MNP-16)

In the present study, we have tested the cytotoxic and DNA damage activity of two novel bis-1,2,4 triazole derivatives, namely 1,4-bis[5-(5-mercapto-1,3,4-oxadiazol-2-yl-methyl)-thio4-(p-tolyl)-1,2 ,4-triazol-3-yl]-butane (MNP-14) and 1,4-bis[5-(carbethoxy-methyl)-thio-4-(p-ethoxy phenyl) -1,2,4-triazol-3-yl]-butane (MNP-16). The effect of these molecules on cellular apoptosis was also determined. The in-vitro cytotoxicity was evaluated by a 3-(4,5-dimethylthiazol-2-yl)-2,5-diphenyl tetrazolium bromide (MTT) assay as well as Trypan blue dye exclusion methods against human acute lymphoblastic leukemia (MOLT4) and lung cancer cells (A549). Our results showed that MNP-16 induced significant cytotoxicity (IC50 of 3-5 mu M) compared with MNP-14. The cytotoxicity induced by MNP-16 was time and concentration dependent. The cell cycle analysis by flow cytometry (fluorescence-activated cell sorting [FACS]) revealed that though there was a significant increase in the apoptotic population (sub-G1 phase) with an increased concentration of MNP-14 and 16, there was no cell cycle arrest. Further, the comet assay results indicated considerable DNA

Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance

We present two online algorithms for maintaining a topological order of a directed n-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm handles m arc additions in O(m(3/2)) time. For sparse graphs (m/n = O(1)), this bound improves the best previous bound by a logarithmic factor, and is tight to within a constant factor among algorithms satisfying a natural locality property. Our second algorithm handles an arbitrary sequence of arc additions in O(n(5/2)) time. For sufficiently dense graphs, this bound improves the best previous bound by a polynomial factor. Our bound may be far from tight: we show that the algorithm can take Omega(n(2)2 root(2lgn)) time by relating its performance to a generalization of the k-levels problem of combinatorial geometry. A completely different algorithm running in Theta (n(2) log n) time was given recently by Bender, Fineman, and Gilbert. We extend both of our algorithms to the maintenance of strong components, without affecting the asymptotic time bounds.

An estimate of equilibrium sensitivity of global terrestrial carbon cycle using NCAR CCSM4

Increasing concentrations of atmospheric CO2 influence climate, terrestrial biosphere productivity and ecosystem carbon storage through its radiative, physiological and fertilization effects. In this paper, we quantify these effects for a doubling of CO2 using a low resolution configuration of the coupled model NCAR CCSM4. In contrast to previous coupled climate-carbon modeling studies, we focus on the near-equilibrium response of the terrestrial carbon cycle. For a doubling of CO2, the radiative effect on the physical climate system causes global mean surface air temperature to increase by 2.14 K, whereas the physiological and fertilization on the land biosphere effects cause a warming of 0.22 K, suggesting that these later effects increase global warming by about 10 % as found in many recent studies. The CO2-fertilization leads to total ecosystem carbon gain of 371 Gt-C (28 %) while the radiative effect causes a loss of 131 Gt-C (10 %) indicating that climate warming damps the fertilization-induced carbon uptake over land. Our model-based estimate for the maximum potential terrestrial carbon uptake resulting from a doubling of atmospheric CO2 concentration (285-570 ppm) is only 242 Gt-C. This highlights the limited storage capacity of the terrestrial carbon reservoir. We also find that the terrestrial carbon storage sensitivity to changes in CO2 and temperature have been estimated to be lower in previous transient simulations because of lags in the climate-carbon system. Our model simulations indicate that the time scale of terrestrial carbon cycle response is greater than 500 years for CO2-fertilization and about 200 years for temperature perturbations. We also find that dynamic changes in vegetation amplify the terrestrial carbon storage sensitivity relative to a static vegetation case: because of changes in tree cover, changes in total ecosystem carbon for CO2-direct and climate effects are amplified by 88 and 72 %, respectively, in simulations with dynamic vegetation when compared to static vegetation simulations.